/*
 * The ELepHant Reasoner
 *
 * Copyright (C) Baris Sertkaya (sertkaya.baris@gmail.com)
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>

#include "../hashing/hash_table.h"

int main(int argc, char *argv[]) {

	HashTable* hash_table = hash_table_create(100);
	int i;
	void* keys[500000];
	void* tmp;

	for (i = 0; i < 500000; ++i) {
		tmp = malloc(sizeof(void));
		printf("%p\n", tmp);
		assert(tmp != NULL);
		hash_table_insert(hash_table, tmp);
		keys[i] = tmp;
	}

	for (i = 0; i < 500000; ++i)
		if (!hash_table_contains(hash_table, keys[i]))
			printf("Does not contain %i\n", i);

	if (!hash_table_contains(hash_table, NULL))
		printf("Does not contain %p\n", NULL);
	return 1;
}


